The Bns Lower-Bound for Multiparty Protocols Is Nearly Optimal
نویسندگان
چکیده
منابع مشابه
A Nearly Tight Lower Bound for Private Information Retrieval Protocols
We show that any 1-round 2-server Private Information Retrieval Protocol where the answers are 1-bit long must ask questions that are at least n− 2 bits long, which is nearly equal to the known n−1 upper bound. This improves upon the approximately 0.25n lower bound of Kerenidis and de Wolf while avoiding their use of quantum techniques.
متن کاملA Nearly Tight Lower Bound for Restricted Private Information Retrieval Protocols
We show that any 1-round 2-server Private Information Retrieval Protocol where the answers are 1-bit long must ask questions that are at least n− 2 bits long, which is nearly equal to the known n−1 upper bound. This improves upon the approximately 0.25n lower bound of Kerenidis and de Wolf while avoiding their use of quantum techniques.
متن کاملScalable Multiparty Computation with Nearly Optimal Work and Resilience
We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmically with n (ignoring an additive term that depends on n but not on the complexity of f). Moreover, the protocol is also nearly optimal in terms of resilience, providing computational security against an active, adaptiv...
متن کاملA Nearly Optimal Lower Bound on the Approximate Degree of AC
The approximate degree of a Boolean function f : {−1, 1} → {−1, 1} is the least degree of a real polynomial that approximates f pointwise to error at most 1/3. We introduce a generic method for increasing the approximate degree of a given function, while preserving its computability by constantdepth circuits. Specifically, we show how to transform any Boolean function f with approximate degree ...
متن کاملAn Optimal Lower Bound for Nonregular Languages
In this paper we prove a tight log n lower bound on the product of strong space and input head reversals for any Turing machine (equipped with a read only input tape) accepting a nonregular language.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1994
ISSN: 0890-5401
DOI: 10.1006/inco.1994.1051